Community Detection Using Robust Label Propagation Algorithm

نویسندگان

  • Lixin Shi
  • Junxing Zhang
چکیده

Because there is so much randomness, the robustness of label propagation algorithm (LPA) is severely hampered. To reduce the randomness, a label propagation algorithm based on degree (LPAD) is proposed. Only the node with extreme degree is labeled initially, and the label is updated according to the sum degree of its neighbors during iteration. The results show that the randomness of LPAD is reduced greatly, the robustness of community partition is improved significantly, and the convergence is speeded up too. Copyright © 2014 IFSA Publishing, S. L.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Community Detection using a New Node Scoring and Synchronous Label Updating of Boundary Nodes in Social Networks

Community structure is vital to discover the important structures and potential property of complex networks. In recent years, the increasing quality of local community detection approaches has become a hot spot in the study of complex network due to the advantages of linear time complexity and applicable for large-scale networks. However, there are many shortcomings in these methods such as in...

متن کامل

Robust network community detection using balanced propagation

Label propagation has proven to be an extremely fast method for detecting communities in large complex networks. Furthermore, due to its simplicity, it is also currently one of the most commonly adopted algorithms in the literature. Despite various subsequent advances, an important issue of the algorithm has not yet been properly addressed. Random (node) update orders within the algorithm sever...

متن کامل

Role-based Label Propagation Algorithm for Community Detection

Community structure of networks provides comprehensive insight into their organizational structure and functional behavior. LPA is one of the most commonly adopted community detection algorithms with nearly linear time complexity. But it suffers from poor stability and occurrence of monster community due to the introduced randomize. We note that different community-oriented node roles impact th...

متن کامل

Semi-supervised Evidential Label Propagation Algorithm for Graph Data

In the task of community detection, there often exists some useful prior information. In this paper, a Semi-supervised clustering approach using a new Evidential Label Propagation strategy (SELP) is proposed to incorporate the domain knowledge into the community detection model. The main advantage of SELP is that it can take limited supervised knowledge to guide the detection process. The prior...

متن کامل

Community detection using boundary nodes in complex networks

We propose a new local community detection algorithm, which finds communities by identifying borderlines between them using boundary nodes. We apply a modified version of label propagation for community detection that uses the number of common neighbors for deciding community label of each node. Our algorithm is fast and finds communities accurately. It outperforms other algorithms especially w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014